Making Nondeterminism Explicit in Z
نویسندگان
چکیده
Specification of system requirements is often involved with ambiguity and nondeterminism. Formal methods tend to mitigate ambiguity but nondeterminism remains as an inherent part of specification. This is due to the abstraction from real world details that causes a formal specification to define several results as a correct solution to a problem. Hence, a support for nondeterminism should be foreseen in formal methods. In this paper, after studying different types of nondeterminism, some basic notations, namely multiand power-schema, are added to Z formal language, to help explicit specification of nondeterminate constructs. Afterwards, a transformation is defined to generate nondeterministic semantics from specification in the same language. The results of adding the proposed notations is discussed from program development point of view.
منابع مشابه
Nondeterminism in Constructive Z
The abstraction inherent in most specifications and the need to specify nondeterministic programs are two well-known sources of nondeterminism in formal specifications. In this paper, we present a formalism, including the notion of multi-schema and a new set of schema calculus operations, by which one can specify bounded, unbounded, loose, strict, erratic, angelic, demonic, singular, and plural...
متن کاملSystematic Removal of Nondeterminism for Code Generation in I O Automata
The Input Output I O automaton model developed by Lynch and Tuttle models components in asynchronous concurrent systems as labeled transition systems IOA is a precise language for de scribing I O automata and for stating their properties A toolset is being developed for IOA to support distributed software design and implemen tation One of the tools consists of a user assisted code generator fro...
متن کاملAn explicit formula for the number of fuzzy subgroups of a finite abelian $p$-group\ of rank two
Ngcibi, Murali and Makamba [Fuzzy subgroups of rank two abelian$p$-group, Iranian J. of Fuzzy Systems {bf 7} (2010), 149-153]considered the number of fuzzy subgroups of a finite abelian$p$-group $mathbb{Z}_{p^m}times mathbb{Z}_{p^n}$ of rank two, andgave explicit formulas for the cases when $m$ is any positiveinteger and $n=1,2,3$. Even though their method can be used for thecases when $n=4,5,l...
متن کاملInfinite trace equivalence
We solve a longstanding problem by providing a denotational model for nondeterministic programs that identifies two programs iff they have the same range of possible behaviours. We discuss the difficulties with traditional approaches, where divergence is bottom or where a term denotes a function from a set of environments. We see that making forcing explicit, in the manner of game semantics, al...
متن کاملCombining CSP and Object-Z: Finite or Infinite Trace Semantics?
In this paper we compare and contrast two alternative semantics as a means of combining CSP with Object-Z. The purpose of this combination is to more effectively specify complex, concurrent systems: while CSP is ideal for modelling systems of concurrent processes, Object-Z is more suitable for modelling the data structures often needed to model the processes themselves. The first semantics, the...
متن کامل